Coalescent Random Forests

نویسنده

  • Jim Pitman
چکیده

Various enumerations of labeled trees and forests, including Cayley's formula n for the number of trees labeled by [n], and Cayley's multinomial expansion over trees, are derived from the following coalescent construction of a sequence of random forests (Rn , Rn&1 , ..., R1) such that Rk has uniform distribution over the set of all forests of k rooted trees labeled by [n]. Let Rn be the trivial forest with n root vertices and no edges. For n k 2, given that Rn , ..., Rk have been defined so that Rk is a rooted forest of k trees, define Rk&1 by addition to Rk of a single edge picked uniformly at random from the set of n(k&1) edges which when added to Rk yield a rooted forest of k&1 trees. This coalescent construction is related to a model for a physical process of clustering or coagulation, the additive coalescent in which a system of masses is subject to binary coalescent collisions, with each pair of masses of magnitudes x and y running a risk at rate x+ y of a coalescent collision resulting in a mass of magnitude x+ y. The transition semigroup of the additive coalescent is shown to involve probability distributions associated with a multinomial expansion over rooted forests. 1999 Academic Press

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a ternary coalescent process

We present a coalescent process where three particles merge at each coagulation step. Using a random walk representation, we prove duality with a fragmentation process, whose fragmentation law we specify explicitly. Furthermore, we give a second construction of the coalescent in terms of random binary forests and study asymptotic properties. Starting from N particles of unit mass, we obtain und...

متن کامل

Coalescent processes arising in a study of diffusive clustering

This paper studies spatial coalescents on Z. In our setting, the partition elements are located at the sites of Z and undergo local delayed coalescence and migration. That is, pairs of partition elements located at the same site coalesce into one partition element after exponential waiting times. In addition, the partition elements perform independent random walks. The system starts in either l...

متن کامل

A Construction of a β-Coalescent via the Pruning of Binary Trees

Considering a random binary tree with n labelled leaves, we use a pruning procedure on this tree in order to construct a β( 3 2 , 1 2 )-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning procedure on Aldous’s continuum random tree, to construct a continuous state space process that has the same structure as the β-coalescent process up to some time chang...

متن کامل

Eternal Additive Coalescents and Certain Bridges with Exchangeable Increments

Aldous and Pitman have studied the asymptotic behavior of the additive coalescent processes using a nested family random forests derived by logging certain inhomogeneous continuum random trees. Here we propose a different approach based on partitions of the unit interval induced by certain bridges with exchangeable increments. The analysis is made simple by an interpretation in terms of an aggr...

متن کامل

Coalescent Random Walks on Graphs

Inspired by coalescent theory in biology, we introduce a stochastic model called ”multi-person simple random walks” or “coalescent random walks” on a graph G. There are any finite number of persons distributed randomly at the vertices of G. In each step of this discrete time Markov chain, we randomly pick up a person and move it to a random adjacent vertex. To study this model, we introduce the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997